package luogu;

import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class P1125 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String s = sc.next();
        int n = 0;
        ArrayList<Integer> list = new ArrayList<>();
        for (int i = 0; i < s.length(); i++) {
            for (int j = 0; j < s.length(); j++) {
                if (s.charAt(i) == s.charAt(j)){
                    n++;
                }
            }
            list.add(n);
            n = 0;
        }
        int ans = Collections.max(list) - Collections.min(list);
        if (isPrime(ans)){
            System.out.println("Lucky Word");
            System.out.println(ans);
        }else {
            System.out.println("No Answer");
            System.out.println(0);
        }
    }
    public static boolean isPrime(int number) {
        if (number < 2) return false;
        if (number == 2) return true;
        if (number % 2 == 0) return false;

        for (int i = 3; i * i <= number; i += 2) {
            if (number % i == 0) {
                return false;
            }
        }
        return true;
    }
}
